INSYST: An Automatic Inserter System for Hierarchical Lexica
نویسندگان
چکیده
When using hierarchical formalisms for lexical information, the need arises to insert (i.e. classify) lexical items into these hierarchies. This includes at least the following two situations: (1) testing generalizations when designing a lexical hierarchy; (2) transferring large numbers of lexical items from raw data files to a finished lexical hierarchy when using it to build a large lexicon. Lip until now, no automated system for these insertion tasks existed. INSYST (INserter SYSTem), we describe here, can efficiently insert lexical items under the appropriate nodes in hierarchies. It currently handles hierarchies specified in the DATR formalism (Evans and Gazdar 1989, 1990). The system uses a classification algorithm that maximizes the number of inherited features for each entry.
منابع مشابه
Development of an Automatic Land Use Extraction System in Urban Areas using VHR Aerial Imagery and GIS Vector Data
Lack of detailed land use (LU) information and efficient data collection methods have made the modeling of urban systems difficult. This study aims to develop a novel hierarchical rule-based LU extraction framework using geographic vector and remotely sensed (RS) data, in order to extract detailed subzonal LU information, residential LU in this study. The LU extraction system is developed to ex...
متن کاملSpecifications of Building Polish Lexica for Application in ASR and TTS Systems
This paper brings detailed information concerning the specifications of building Polish lexica of common and special application words for use in speech applications such as ASR (automatic speech recognition) or TTS (text-to-speech) synthesis. The specifications include information on the collection of text corpora and word lists, phonetic, grammatical and morphological annotation, as well as s...
متن کاملDesign and implementation of an automatic car turning system
In this paper, a control system is designed for automatic car turning. At first, the necessary information of car turning that were collected from the traffic bylaw, car driving training centers and traffic police are explained. Then, car turning is studied experimentally on several streets with different widths. Afterward, a proper path is designed for the automatic car turning system consider...
متن کاملTraining of Lexica for Subword-Based Speech Recognisers
In this paper we present an automatic optimal baseform determination algorithm. Given a set of subword Hidden Markov Models (HMMs) and acoustic tokens of a speciic word, we apply the tree-trellis N-best search algorithm to nd the optimal baseforms (transcriptions) in the maximum likelihood sense. The proposed algorithm is used in an iterative manner, creating a series of lexica trained from the...
متن کاملWatermarking scheme capable of resisting attacks based on availability of inserter
Attacks based on the presence of watermark inserter are easy to perform since they make use of similarity between an original watermark and additionally added ones by using the same inserter and key. In this paper, a novel watermarking scheme capable of resisting inserter attacks is proposed. Watermark signals corresponding to the same key are mutually independent if they are randomly selected ...
متن کامل